Long Text QA Matching Model Based on BiGRU–DAttention–DSSM

نویسندگان

چکیده

QA matching is a very important task in natural language processing, but current research on text focuses more short rather than long matching. Compared with matching, rich information, distracting information frequent. This paper extracted question-and-answer pairs about psychological counseling to QA-matching technology based deep learning. We adjusted DSSM (Deep Structured Semantic Model) make it suitable for the task. Moreover, better extraction of features, we also improved by enriching representation layer, using bidirectional neural network and attention mechanism. The experimental results show that BiGRU–Dattention–DSSM performs at questions answers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

A Semantic QA-Based Approach for Text Summarization Evaluation

Many Natural Language Processing and Computational Linguistics applications involves the generation of new texts based on some existing texts, such as summarization, text simplification and machine translation. However, there has been a serious problem haunting these applications for decades, that is, how to automatically and accurately assess quality of these applications. In this paper, we wi...

متن کامل

Quasi text-independent speaker-verification based on pattern matching

We present a new approach to quasi text-independent speaker verification based on pattern matching. Our method first seeks phonetically matched segments in two speech signals. For all aligned frame pairs of these segments we compute the probability that they were uttered by the same speaker. Based on these frame-level probabilities we take the decision whether the two signals were spoken by the...

متن کامل

A text pattern-matching tool based on Parsing Expression Grammars

Current text pattern-matching tools are based on regular expressions. However, pure regular expressions have proven too weak a formalism for the task: many interesting patterns either are difficult to describe or cannot be described by regular expressions. Moreover, the inherent nondeterminism of regular expressions does not fit the need to capture specific parts of a match. Motivated by these ...

متن کامل

Fractured Reservoirs History Matching based on Proxy Model and Intelligent Optimization Algorithms

   In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM) as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values) based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9101129